|
課程名稱 |
演算法
Algorithms |
|
開課學期 |
100-1 |
|
授課對象 |
學程 積體電路設計第二專長學程 |
|
授課教師 |
張耀文 |
|
課號 |
EE4033 |
|
課程識別碼 |
901 39000 |
|
班次 |
|
|
學分 |
3 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期三6,7,8(13:20~16:20) |
|
上課地點 |
電二143 |
|
備註 |
總人數上限：80人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
Course Contents: Topics include
1. Algorithmic fundamentals: mathematical foundations, growth of functions, recurrences (5 hrs)
2. Sorting and order statistics (5 hrs)
3. Data structures: heap, binary search trees, RB trees, disjoint sets (4 hrs)
4. Advanced design and analysis techniques: dynamic programming, greedy algorithms, amortized analysis (11 hrs)
5. Graph algorithms: graph representations, searching, minimum spanning trees, shortest paths, matching, network flow (14 hrs)
6. NP-completeness, computational complexity, and approximation algorithms (6 hrs)
7. General-purpose algorithms: computational geometry,
branch and bound, and simulated annealing, as time permits.
|
|
課程目標 |
Course Objective: Focuses on the design and analysis of algorithms and their applications, and develops problem-solving techniques. |
|
課程要求 |
Prerequisites: data structures (or discrete mathematics).
Six homework assignments (+ in-class quizzes) 30%,
three mini programming assignments 20%,
two in-class tests 50%,
and bonuses for class participation. |
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
|
|
參考書目 |
教科書.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,
Introduction to Algorithms, 3rd Ed.,
MIT Press/McGraw Hill, 2009.
ISBN: 0-262-03384-4 / 978-0-262-03384-8. |
|
評量方式
(僅供參考) |
|
|